On the Turán number of some ordered even cycles
نویسندگان
چکیده
منابع مشابه
Rainbow Turán problem for even cycles
An edge-colored graph is rainbow if all its edges are colored with distinct colors. For a fixed graph H , the rainbow Turán number ex(n,H) is defined as themaximumnumber of edges in a properly edge-colored graph on n vertices with no rainbow copy of H . We study the rainbow Turán number of even cycles, and prove that for every fixed ε > 0, there is a constant C(ε) such that every properly edge-...
متن کاملOn the Turán Number of Forests
The Turán number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turán number and find the unique extremal graph for forests consisting of paths when n is sufficiently large. This generalizes a result of Bushaw and Kettle [Combinatorics, Probability and Computing 20:837–853, 2011]. We also determine the Turán n...
متن کاملOn the Turán Number of Triple Systems
For a family of r-graphs F , the Turán number ex(n,F) is the maximum number of edges in an n vertex r-graph that does not contain any member of F . The Turán density π(F) = lim n→∞ ex(n,F) ( n r ) . When F is an r-graph, π(F) 6= 0, and r > 2, determining π(F) is a notoriously hard problem, even for very simple r-graphs F . For example, when r = 3, the value of π(F) is known for very few (< 10) ...
متن کاملThe 3-colored Ramsey number of even cycles
Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdős conjectured that when L is the cycle Cn on n vertices, R(Cn, Cn, Cn) = 4n − 3 for every odd n > 3. Luczak proved that if n is odd, then R(Cn, Cn, Cn) = 4n + o(n), as n → ∞, and Kohayakawa, Simonovits and Skokan confirmed...
متن کاملOn the Ramsey-Turán number with small s-independence number
Let s be an integer, f = f(n) a function, and H a graph. Define the Ramsey-Turán number RTs(n,H, f) as the maximum number of edges in an H-free graph G of order n with αs(G) < f , where αs(G) is the maximum number of vertices in a Ks-free induced subgraph of G. The Ramsey-Turán number attracted a considerable amount of attention and has been mainly studied for f not too much smaller than n. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2018
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.05.008